Williamson matrices of orders 4·29 and 4·31
نویسندگان
چکیده
منابع مشابه
Some infinite classes of Williamson matrices and weighing matrices
Williamson type matrices A, B, C 1 D will be called nice if ABT + C DT = 0, perfect if ABT + CDT = ACT + BDT 0, special if ABT + CDT = ACT + BDT = ADT + BCT = o. Type 1 (1 , -1 )-matrices A, B, C, D of order n will be called tight Williamson-like matrices if AAT + BBT + CCT + DDT 4nIn and ABT + BAT + CDT + DCT o. Write N = 32T . piTl ••• p!Tn , where Pj 3(mod 4), Pj > 3, j = 1, ... ,n and r, rl...
متن کاملWilliamson matrices up to order 59
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We find all nonequivalent Williamson matrices of odd order n up to n = 59. It turns out that there are none for n = 35, 47, 53, 59 and it seems that the Turyn class may be the only infinite class of these matrices. AMS Su...
متن کاملA new construction for Williamson-type matrices
It is shown that if q is a prime power then there are Williamson-type matrices of order (i) 1/2q2(q + 1) when q ≡ 1 (mod 4), (ii)1/4q2(q + 1) when q ≡ 3 (mod 4) and there are Williamson-type matrices of order l/4(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an H...
متن کاملSemi Williamson Type Matrices and the W (2n; N) Conjecture
Four (1,-1, 0)-matrices of order m, X = (x ij), Y = (y ij), Z = (z ij), U = (u ij) satisfying will be called semi Williamson type matrices of order m. In this paper we prove that if there exist Williamson type matrices of order n 1 ;: :: ;n k then there exist semi Williamson type matrices of order N = Q k j=1 n rj j , where r j are non-negative integers. As an application, we obtain a W(4N;2N)....
متن کاملOn the asymptotic existence of complex Williamson Hadamard matrices
It is shown that for each odd integer q, there is a complex WilliamsonHadamard matrix of order 2(q)+1 ·2n (q)+1 . q. In a recent paper Craigen, Holzmann and Kharaghani [1] showed that for every odd integer q) there is an integer N( q) which does not exceed twice the number of nonzero digits in the binary expansion of q, such that the existence of an Orthogonal Design (OD) of order 2N (q)-1 impl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1992
ISSN: 0097-3165
DOI: 10.1016/0097-3165(92)90071-2